import fractions



def prime_factors(n):
    """Returns all the prime factors of a positive integer"""
    factors = []
    d = 2
    while n > 1:
        while n % d == 0:
            factors.append(d)
            n /= d
        d = d + 1

    return factors

if __name__ == '__main__':
	n = 5, 8, 12, 20, 25
	for j in n:
	  i = 0
	  while i < j:
	    if fractions.gcd(i,j) == 1:
	      print("gcd(" + str(i) + "," + str(j) + ") = 1")
	    i = i + 1

